Revisiting Traveling Salesman Problem (TSP): Analysis of GA and SA based Solutions

Application of multi-step GA to the traveling salesman problem

Although GAS are widely used for optimization problems and have obtained many good results, these are also holding problems, such as premature convergence problems and evolutionary stagnation problems. In this papel; the premature convergence caused by reduction of the diversity and evolutionary stagnation in GAS are observed, and a new genetic algorithm, named multi-step GA(MSGA) is proposed. ...

Hybrid CW-GA Metaheuristic for the Traveling Salesman Problem

The Traveling Salesman Problem (TSP) is one of the most challenging problems in Logistics and Supply Chain Management. Its relevance in routing planning and distribution has significant impact on reduction of operative costs for all enterprises. However, due to its NP-hard complexity, it is difficult to obtain optimal solutions for TSP instances. This paper describes a hybrid approach based on ...

An Approach for Solving Traveling Salesman Problem

In this paper, we introduce a new approach for solving the traveling salesman problems (TSP) and provide a solution algorithm for a variant of this problem. The concept of the proposed method is based on the Hungarian algorithm, which has been used to solve an assignment problem for reaching an optimal solution. We introduced a new fittest criterion for crossing over such problems, and illu...

Probabilistic analysis of the Traveling Salesman Problem

Solving Traveling Salesman Problem based on Biogeography-based Optimization and Edge Assembly Cross-over

Biogeography-Based Optimization (BBO) algorithm has recently been of great interest to researchers for simplicity of implementation, efficiency, and the low number of parameters. The BBO Algorithm in optimization problems is one of the new algorithms which have been developed based on the biogeography concept. This algorithm uses the idea of animal migration to find suitable habitats for solvin...